Extreme points of the credal sets generated by comparative probabilities
نویسندگان
چکیده
منابع مشابه
Extreme Points of the Credal Sets Generated by Comparative Probabilities
When using convex probability sets (or, equivalently, lower previsions) as uncertainty models, identifying extreme points can help simplifying various computations or the use of some algorithms. In general, sets induced by specific models such as possibility distributions, linear vacuous mixtures or 2-monotone measures may have extreme points easier to compute than generic convex sets. In this ...
متن کاملExtreme Points of the Credal Sets Generated by Elementary Comparative Probabilities
When using convex probability sets (or, equivalently, lower previsions) as models of uncertainty, identifying extreme points can be useful to perform various computations or to use some algorithms. In general, sets induced by specific models such as possibility distributions, linear vacuous mixture or 2-monotone measures may have extreme points easier to compute than generic convex sets. In thi...
متن کاملExtreme points of credal sets generated by 2-alternating capacities
The characterization of the extreme points constitutes a crucial issue in the investigation of convex sets of probabilities, not only from a purely theoretical point of view, but also as a tool in the management of imprecise information. In this respect, different authors have found an interesting relation between the extreme points of the class of probability measures dominated by a second ord...
متن کاملCredal Sets Approximation by Lower Probabilities: Application to Credal Networks
Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as constraints defining a second credal set. This simple procedure produces an outer approximation, with a bounded number of extreme points, for general credal sets. The approximation is optimal in the sense that no other lower probabi...
متن کاملInference with Seperately Specified Sets of Probabilities in Credal Networks
We present new algorithms for inference in credal networksdirected acyclic graphs asso ciated with sets of probabilities. Credal networks are here interpreted as encoding strong indepen dence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this set ting. We th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Psychology
سال: 2015
ISSN: 0022-2496
DOI: 10.1016/j.jmp.2014.11.004